An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Upper Bound on the Radius of a 3-Edge-Connected Graph

Let G be a 3-edge-connected graph of order n and radius rad(G). Then the inequality rad(G) ≤ 1 3 n+ 17 3 is proved. Moreover, graphs are constructed to show that the bound is asymptotically sharp.

متن کامل

a study on the effectiveness of textual modification on the improvement of iranian upper-intermediate efl learners’ reading comprehension

این پژوهش به منظور بررسی تأثیر اصلاح متنی بر بهبود توانایی درک مطلب زبان آموزان ایرانی بالاتر از سطح میانی انجام پذیرفت .بدین منظور 115 دانشجوی مرد و زن رشته مترجمی زبان انگلیسی در این پزوهش شرکت نمودند.

An upper bound on the domination number of n-vertex connected cubic graphs

In 1996, Reed proved that the domination number γ (G) of every n-vertex graph G with minimum degree at least 3 is at most 3n/8. This bound is sharp for cubic graphs if there is no restriction on connectivity. In this paper we show that γ (G) ≤ 4n/11 for every n-vertex cubic connected graph G if n > 8. Note that Reed’s conjecture that γ (G) ≤ dn/3e for every connected cubic n-vertex graph G is n...

متن کامل

An Upper Bound on the Spectral Radius of Weighted Graphs

We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. We obtain another upper bound which is sharp on the spectral radius of the adjacency matrix and compare with some known upper bounds with the help of some examples of graphs. We also characterize graphs for which the bound is attained.

متن کامل

The connected forcing connected vertex detour number of a graph

For any vertex x in a connected graph G of order p ≥ 2, a set S of vertices of V is an x-detour set of G if each vertex v in G lies on an x-y detour for some element y in S. A connected x-detour set of G is an x-detour set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected x-detour set of G is the connected x-detour number of G and is denoted by cdx(...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematics

سال: 2020

ISSN: 2314-4629,2314-4785

DOI: 10.1155/2020/8367408